The weighted hook-length formula II: Complementary formulas
نویسندگان
چکیده
منابع مشابه
The weighted hook-length formula II: Complementary formulas
Let λ = (λ1, λ2, . . . , λl), λ1 ≥ λ2 ≥ . . . ≥ λl > 0, be a partition of n, λ ⊢ n, and let [λ] = {(i, j) ∈ Z : 1 ≤ i ≤ l, 1 ≤ j ≤ λi} be the corresponding Young diagram. The conjugate partition λ is defined by λj = max{i : λi ≥ j}. We will freely use implications such as i ≤ j ⇒ λi ≥ λj. The hook Hz ⊆ [λ] is the set of squares weakly to the right and below of z = (i, j) ∈ [λ], and the hook len...
متن کاملThe weighted hook length formula
Abstract. Based on the ideas in [CKP], we introduce the weighted analogue of the branching rule for the classical hook length formula, and give two proofs of this result. The first proof is completely bijective, and in a special case gives a new short combinatorial proof of the hook length formula. Our second proof is probabilistic, generalizing the (usual) hook walk proof of Green-Nijenhuis-Wi...
متن کاملThe Weighted Hook Length Formula III: Shifted Tableaux
Recently, a simple proof of the hook length formula was given via the branching rule. In this paper, we extend the results to shifted tableaux. We give a bijective proof of the branching rule for the hook lengths for shifted tableaux; present variants of this rule, including weighted versions; and make the first tentative steps toward a bijective proof of the hook length formula for d-complete ...
متن کاملWeighted branching formulas for the hook lengths
The famous hook-length formula is a simple consequence of the branching rule for the hook lengths. While the Greene-Nijenhuis-Wilf probabilistic proof is the most famous proof of the rule, it is not completely combinatorial, and a simple bijection was an open problem for a long time. In this extended abstract, we show an elegant bijective argument that proves a stronger, weighted analogue of th...
متن کاملOn Han's Hook Length Formulas for Trees
Recently, Han obtained two hook length formulas for binary trees and asked for combinatorial proofs. One of Han’s formulas has been generalized to k-ary trees by Yang. Sagan has found a probabilistic proof of Yang’s extension. We give combinatorial proofs of Yang’s formula for k-ary trees and the other formula of Han for binary trees. Our bijections are based on the structure of k-ary trees ass...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2011
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.01.005